Twelve Ways to Fool the Masses When Giving Performance Results on Parallel Computers

نویسنده

  • David H. Bailey
چکیده

Many of us in the field of highly parallel scientific computing recognize that it is often quite difficult to match the run time performance of the best conventional supercomputers. This humorous article outlines twelve ways commonly used in scientific papers and presentations to artificially boost performance rates and to present these results in the ``best possible light'' compared to other

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Twelve Ways to Fool The Masses when Describing Mesh Generation Performance

Mesh generation for finite element analysis is far from a solved problem. Although several automatic meshing algorithms exist, other difficulties of setting up a problem for finite element analysis still make this an interactive process. Undaunted, we continue to perform research on, and therefore publish, papers describing their work to overcome these problems. In our efforts to describe our w...

متن کامل

Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers

This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...

متن کامل

A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

متن کامل

Volunteer computing

The explosive growth of interest in platform-independent programming languages for the WorldWide Web , such as Sun Microsystems' Java, is opening exciting new possibilites in parallel computing. This thesis will present and investigate the idea of volunteer computing, which will allow people to volunteer their computers' processing power towards solving a large parallel problem by simply visiti...

متن کامل

Maslsively Parallel Computers: Why Not Prwallel Computers for the Masses?

During the 1980s the computers engineering and science research community generally ignored parallel processing. With a focus on high performance computing embodied in the massive 1990s High Performance Computing and Communications (HPCC) program that has the short-term, teraflop peak performanc~: goal using a network of thousands of computers, everyone with even passing interest in parallelism...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003